Deterministic Sensing Matrices in Compressive Sensing: A Survey

نویسندگان

  • Thu L. N. Nguyen
  • Yoan Shin
چکیده

Compressive sensing is a sampling method which provides a new approach to efficient signal compression and recovery by exploiting the fact that a sparse signal can be suitably reconstructed from very few measurements. One of the most concerns in compressive sensing is the construction of the sensing matrices. While random sensing matrices have been widely studied, only a few deterministic sensing matrices have been considered. These matrices are highly desirable on structure which allows fast implementation with reduced storage requirements. In this paper, a survey of deterministic sensing matrices for compressive sensing is presented. We introduce a basic problem in compressive sensing and some disadvantage of the random sensing matrices. Some recent results on construction of the deterministic sensing matrices are discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical Recovery in Compressive Sensing

A combinatorial approach to compressive sensing based on a deterministic column replacement technique is proposed. Informally, it takes as input a pattern matrix and ingredient measurement matrices, and results in a larger measurement matrix by replacing elements of the pattern matrix with columns from the ingredient matrices. This hierarchical technique yields great flexibility in sparse signa...

متن کامل

A Class of Deterministic Sensing Matrices and Their Application in Harmonic Detection

Abstract In this paper, a class of deterministic sensing matrices are constructed by selecting rows from Fourier matrices. These matrices have better performance in sparse recovery than random partial Fourier matrices. The coherence and restricted isometry property of these matrices are given to evaluate their capacity as compressive sensing matrices. In general, compressed sensing requires ran...

متن کامل

Image reconstruction by deterministic compressed sensing with chirp matrices†

A recently proposed approach for compressed sensing, or compressive sampling, with deterministic measurement matrices made of chirps is applied to images that possess varying degrees of sparsity in their wavelet representations. The “fast reconstruction” algorithm enabled by this deterministic sampling scheme as developed by Applebaum et al. [1] produces accurate results, but its speed is hampe...

متن کامل

Deterministic Compressive Sensing with Groups of Random Variables

Compressed Sensing aims to capture attributes of a sparse signal using very few measurements. Candès and Tao showed that random matrices satisfy the Restricted Isometry Property or RIP property with high probability. They showed that this condition is sufficient for sparse reconstruction and that random matrices, where the entries are generated by an iid Gaussian or Bernoulli process, satisfy t...

متن کامل

Sensing Matrix Design via Capacity Maximization for Block Compressive Sensing Applications

It is well established in the compressive sensing (CS) literature that sensing matrices whose elements are drawn from independent random distributions exhibit enhanced reconstruction capabilities. In many CS applications, such as electromagnetic imaging, practical limitations on the measurement system prevent one from generating sensing matrices in this fashion. Although one can usually randomi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 2013  شماره 

صفحات  -

تاریخ انتشار 2013